3 // Copyright (C) 2005 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
30 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32 // Permission to use, copy, modify, sell, and distribute this software
33 // is hereby granted without fee, provided that the above copyright
34 // notice appears in all copies, and that both that copyright notice and
35 // this permission notice appear in supporting documentation. None of
36 // the above authors, nor IBM Haifa Research Laboratories, make any
37 // representation about the suitability of this software for any
38 // purpose. It is provided "as is" without express or implied warranty.
41 * @file insert_fn_imps.hpp
42 * Contains an implementation for rb_tree_.
46 inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
47 PB_ASSOC_CLASS_C_DEC::
48 insert(const_reference r_value)
50 PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
52 std::pair<find_iterator, bool> ins_pair =
53 PB_ASSOC_BASE_C_DEC::insert_leaf(r_value);
55 if (ins_pair.second == true)
57 ins_pair.first.m_p_nd->m_red = true;
59 PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(false, true);)
61 insert_fixup(ins_pair.first.m_p_nd);
64 PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
65 PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
70 #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
72 inline typename PB_ASSOC_CLASS_C_DEC::data_reference
73 PB_ASSOC_CLASS_C_DEC::
74 subscript_imp(const_key_reference r_key)
76 PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
78 std::pair<find_iterator, bool> ins_pair =
79 PB_ASSOC_BASE_C_DEC::insert_leaf(
80 value_type(r_key, data_type()));
82 if (ins_pair.second == true)
84 ins_pair.first.m_p_nd->m_red = true;
86 PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid());
88 insert_fixup(ins_pair.first.m_p_nd);
91 PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
92 PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_iterators();)
94 return (ins_pair.first.m_p_nd->m_value.second);
96 #endif // #ifdef PB_ASSOC_DATA_TRUE
100 PB_ASSOC_CLASS_C_DEC::
101 insert_fixup(node_pointer p_nd)
103 PB_ASSOC_DBG_ASSERT(p_nd->m_red == true);
105 while (p_nd != PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent&&
106 p_nd->m_p_parent->m_red)
108 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
110 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
112 if (p_y != NULL&& p_y->m_red)
114 p_nd->m_p_parent->m_red = false;
118 p_nd->m_p_parent->m_p_parent->m_red = true;
120 p_nd = p_nd->m_p_parent->m_p_parent;
124 if (p_nd == p_nd->m_p_parent->m_p_right)
126 p_nd = p_nd->m_p_parent;
128 PB_ASSOC_BASE_C_DEC::rotate_left(p_nd);
131 p_nd->m_p_parent->m_red = false;
133 p_nd->m_p_parent->m_p_parent->m_red = true;
135 PB_ASSOC_BASE_C_DEC::rotate_right(
136 p_nd->m_p_parent->m_p_parent);
141 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left;
143 if (p_y != NULL&& p_y->m_red)
145 p_nd->m_p_parent->m_red = false;
149 p_nd->m_p_parent->m_p_parent->m_red = true;
151 p_nd = p_nd->m_p_parent->m_p_parent;
155 if (p_nd == p_nd->m_p_parent->m_p_left)
157 p_nd = p_nd->m_p_parent;
159 PB_ASSOC_BASE_C_DEC::rotate_right(p_nd);
162 p_nd->m_p_parent->m_red = false;
164 p_nd->m_p_parent->m_p_parent->m_red = true;
166 PB_ASSOC_BASE_C_DEC::rotate_left(
167 p_nd->m_p_parent->m_p_parent);
172 PB_ASSOC_BASE_C_DEC::update_to_top(p_nd, (Node_Updator* )this);
174 PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent->m_red = false;